INERTIAL MANN-KRASNOSELSKII ALGORITHM WITH SELF ADAPTIVE STEPSIZE FOR SPLIT VARIATIONAL INCLUSION PROBLEM AND PARAMONOTONE EQUILIBRIA

نویسندگان

چکیده

In this paper, we introduce a Mann-Krasnoselskii algorithm of inertial form for approximating common solution Spit Variational Inclusion Problem (SVIP) and Equilibrium (EP) with paramonotone bifunction in real Hilbert spaces. Motivated by the self-adaptive technique, incorporate technique to accelerate convergence proposed method. Under standard mild assumptions such as monotonicity lower semicontinuity SVIP EP associated mappings, establish strong iterative algorithm. Some applications numerical experiments are presented illustrate performance behaviour our method well comparing it some related methods literature. Our results improve generalize many existing direction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Mathematical programming with multiple sets split monotone variational inclusion constraints

In this paper, we first study a hierarchical problem of Baillon’s type, and we study a strong convergence theorem of this problem. For the special case of this convergence theorem, we obtain a strong convergence theorem for the ergodic theorem of Baillon’s type. Our result of the ergodic theorem of Baillon’s type improves and generalizes many existence theorems of this type of problem. Two nume...

متن کامل

A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem

This paper deals with the split feasibility problem that requires to find a point closest to a closed convex set in one space such that its image under a linear transformation will be closest to another closed convex set in the image space. By combining perturbed strategy with inertial technique, we construct an inertial perturbed projection algorithm for solving the split feasibility problem. ...

متن کامل

Self-Adaptive and Relaxed Self-Adaptive Projection Methods for Solving the Multiple-Set Split Feasibility Problem

and Applied Analysis 3 half-spaces, so that the algorithm is implementable. We need not estimate the Lipschitz constant and make a sufficient decrease of the objection function at each iteration; besides, these projection algorithms can reduce to the modifications of the CQ algorithm 6 when the MSSFP 1.1 is reduced to the SFP. We also show convergence the algorithms under mild conditions.

متن کامل

The Split Variational Inequality Problem

We propose a new variational problem which we call the Split Variational Inequality Problem (SVIP). It entails …nding a solution of one Variational Inequality Problem (VIP), the image of which under a given bounded linear transformation is a solution of another VIP. We construct iterative algorithms that solve such problems, under reasonable conditions, in Hilbert space and then discuss special...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Modelling and Analysis

سال: 2022

ISSN: ['1648-3510', '1392-6292']

DOI: https://doi.org/10.3846/mma.2022.13949